Graph decompositions through prescribed vertices without isolates
نویسندگان
چکیده
Let G be a graph of order n, and let n = P k i=1 a i be a partition of n with a i 2. Let v 1 ; : : : ; v k be given distinct vertices of G. Suppose that the minimum degree of G is at least 3k. In this paper, we prove that there exists a decomposition of the vertex set V (G) = S k i=1 A i such that jA i j = a i , v i 2 A i , and the subgraph induced by A i contains no isolated vertices for all i, 1 i k.
منابع مشابه
On short cycles through prescribed vertices of a polyhedral graph
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a polyhedral graph or plane triangulation are proved.
متن کاملOn Compatible Star Decompositions of Simple Polygons
We introduce the notion of compatible star decompositions of simple polygons. In general, given two polygons with a correspondence between their vertices, two polygonal decompositions of the two polygons are said to be compatible if there exists a one-to-one mapping between them such that the corresponding pieces are defined by corresponding vertices. For compatible star decompositions, we also...
متن کاملFair Factorizations of the Complete Multipartite Graph and Related Edge-Colorings by
In this dissertation, first the technique of vertex amalgamations is used to extend known results on graph decompositions, and in particular on decompositions of the complete multipartite graph K(n, p) with p parts, each of which has n vertices. The decompositions focus on hamilton cycles and 1-factors that satisfy certain fairness notions, as well as frame versions of these results where each ...
متن کاملOn short cycles through prescribed vertices of a graph
For c 2 and k minfc; 3g, guaranteed upper bounds on the length of a shortest cycle through k prescribed vertices of a c-connected graph are proved. Analogous results on planar graphs are presented, too.
متن کاملDecompositions of multigraphs into parts with two edges
Given a family F of multigraphs without isolated vertices, a multigraph M is called F-decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of F . We present necessary and sufficient conditions for the existence of such decompositions if F comprises two multigraphs from the set consisting of a 2-cycle, a 2-matching and a path with two edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 62 شماره
صفحات -
تاریخ انتشار 2002